//#define _CRT_SECURE_NO_WARNINGS 1
//#include"SList.h"
////void test(void)
////{
////	SLTNode* n1 = (SLTNode*)malloc(sizeof(SLTNode));
////	assert(n1);
////	SLTNode* n2 = (SLTNode*)malloc(sizeof(SLTNode));
////	assert(n2);
////	SLTNode* n3 = (SLTNode*)malloc(sizeof(SLTNode));
////	assert(n3);
////	SLTNode* n4 = (SLTNode*)malloc(sizeof(SLTNode));
////	assert(n4);
////	SLTNode* n5 = (SLTNode*)malloc(sizeof(SLTNode));
////	assert(n5);
////
////	n1->data = 1;
////	n2->data = 2;
////	n3->data = 3;
////	n4->data = 4;
////	n5->data = 5;
////
////	n1->next = n2;
////	n2->next = n3;
////	n3->next = n4;
////	n4->next = n5;
////	n5->next = NULL;
////	SListPrint(n1);
////	//SListPushBack(n1, 50);
////	SListPrint(n1);
////}
//void SListtest1()
//{
//	SLTNode* plist = NULL;
//	//SListPushBack(&plist, 50);
//	//SListPrint(plist);
//	//SListPushBack(&plist, 50);
//	//SListPushBack(&plist, 50);
//	//SListPushBack(&plist, 50);
//	//SListPrint(plist);
//	SListPushFront(&plist, 20);
//	SListPushFront(&plist, 30);
//	SListPushFront(&plist, 40);
//	SListPushFront(&plist, 50);
//	SListPrint(plist);
//	//SListPopFront(&plist);
//	//SListPopFront(&plist);
//	//SListPopFront(&plist);
//	//SListPopFront(&plist);
//	//SListPopFront(&plist);
//	//SListPrint(plist);
//	SListPopBack(&plist);
//	SListPrint(plist);
//	SListPopBack(&plist);
//	SListPrint(plist);
//	SListPopBack(&plist);
//	SListPrint(plist);
//	SListPopBack(&plist);
//	SListPrint(plist);
//}
//
//void SListtest2()
//{
//	SLTNode* plist = NULL;
//	SListPushFront(&plist, 20);
//	SListPushFront(&plist, 30);
//	SListPushFront(&plist, 40);
//	SListPushFront(&plist, 50);
//	SListPrint(plist);
//	SLTNode* pos = SListFind(plist,50);
//	//pos->data = 888;
//	//SListPrint(plist);
//	//pos = NULL;
//	/*SListInsert(&plist, pos, 55);
//	SListPrint(plist);*/
//	//SListErase(&plist, pos);
//	//SListInsertAfter(&plist, pos, 37);
//	SListEraseAfter(&plist, pos);
//	SListPrint(plist);
//}
//int main()
//{
//	SListtest2();
//	return 0;
//}
